
275
[101] Z. Li and W. Dong, A stroke-based method for automated generation of schematic network maps,
Int. J. Geogr. Inf. Sci. 24 no. 11 (2010), 1631–1647. https://doi.org/10.1080/13658811003766936.
[102] S. Liu, Y. Chu, H. Hu, J. Feng, and X. Zhu, Top-k spatio-textual similarity search, in WAIM 2014,
Macau, China, June 16-18, 2014. Proceedings, 8485, Springer, 2014, pp. 602–614. https://doi.org/
10.1007/978-3-319-08010-9_65.
[103] X. Liu, J. Biagioni, J. Eriksson, Y. Wang, G. Forman, and Y. Zhu, Mining large-scale, sparse
GPS traces for map inference: comparison of approaches, in The 18th ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining, KDD ’12, Beijing, China, August 12-16, 2012
(Q. Yang, D. Agarwal, and J. Pei, eds.), ACM, 2012, pp. 669–677. https://doi.org/10.1145/
2339530.2339637.
[104] Y. Lou, C. Zhang, Y. Zheng, X. Xie, W. Wang, and Y. Huang, Map-matching for low-sampling-rate
GPS trajectories, in 17th ACM SIGSPATIAL International Symposium on Advances in Geographic In-
formation Systems, ACM-GIS 2009, November 4-6, 2009, Seattle, Washington, USA, Proceedings, ACM,
2009, pp. 352–361. https://doi.org/10.1145/1653771.1653820.
[105] J. F. Lynch, The equivalence of theorem proving and the interconnection problem, ACM SIGDA
Newsletter 5 no. 3 (1975), 31–36. https://doi.org/10.1145/1061425.1061430.
[106] D. Merrick and J. Gudmundsson, Path simplication for metro map layout, in Graph Drawing,
14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers,
Lecture Notes in Computer Science 4372, Springer, 2006, pp. 258–269. https://doi.org/10.1007/
978-3-540-70904-6_26.
[107] T. Milea, O. Schrijvers, K. Buchin, and H. J. Haverkort, Shortest-paths preserving metro maps,
in Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September
21-23, 2011, Revised Selected Papers, Lecture Notes in Computer Science 7034, Springer, 2011, pp. 445–
446. https://doi.org/10.1007/978-3-642-25878-7_45.
[108] J. Mondzech and M. Sester, Quality analysis of OpenStreetMap data based on application needs,
Cartogr. Int. J. Geogr. Inf. Geovisualization 46 no. 2 (2011), 115–125. https://doi.org/10.3138/
carto.46.2.115.
[109] P. Newson and J. Krumm, Hidden Markov map matching through noise and sparseness, in 17th
ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-
GIS 2009, November 4-6, 2009, Seattle, Washington, USA, Proceedings, ACM, 2009, pp. 336–343. https:
//doi.org/10.1145/1653771.1653818.
[110] E. J. Newton and M. J. Roberts, Concentric circles maps: Data and implications, Proceedings of the
Theory and Application of Diagrams (Edinburgh, UK, 2018) 17 (2018), 24.
[111] G. Neyer, Line simplication with restricted orientations, in Algorithms and Data Structures, 6th
International Workshop, WADS ’99, Vancouver, British Columbia, Canada, August 11-14, 1999, Pro-
ceedings, Lecture Notes in Computer Science 1663, Springer, 1999, pp. 13–24. https://doi.org/10.
1007/3-540-48447-7_2.
[112] S. Nickel and M. Nöllenburg, Drawing k-linear metro maps, CoRR abs/1904.03039 (2019). Avail-
able at http://arxiv.org/abs/1904.03039.
[113] B. Niedermann and I. Rutter, An integer-linear program for bend-minimization in ortho-radial
drawings, in Graph Drawing and Network Visualization - 28th International Symposium, GD 2020,
Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (D. Auber and P. Valtr, eds.),
Lecture Notes in Computer Science 12590, Springer, 2020, pp. 235–249. https://doi.org/10.1007/
978-3-030-68766-3_19.
[114] B. Niedermann, I. Rutter, and M. Wolf, Ecient algorithms for ortho-radial graph drawing, in
35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland,
Oregon, USA, LIPIcs 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, pp. 53:1–53:14.
https://doi.org/10.4230/LIPIcs.SoCG.2019.53.
[115] M. Nöllenburg, Automated drawing of metro maps, Universität Karlsruhe, Fakultät für Informatik,
2005.